package leetcode;

import static java.util.Arrays.sort;

/**
 * @author Liangyaoyun
 */
public class reversePairs {
    public void mergeSort(int[] nums){
        int[] tmp=new int[nums.length-1];
        mergeSortInner(nums,0,nums.length-1,tmp);
    }
    public void mergeSortInner(int[] nums,int start,int end,int[] tmp){
        if (end-start<=0){
            return;
        }
        int middle=(end-start)/2+start;
        mergeSortInner(nums,start,middle,tmp);
        mergeSortInner(nums,middle+1,end,tmp);
        int i=0;
        int j=0;
        int k=0;
        for (int l = start; l <middle ; l++) {
            tmp[l]=nums[l];
        }
        for (int l = middle+1; l <end ; l++) {
            tmp[l] = nums[l];
        }

    }
    public int reversePairs(int[] nums) {
        return 0;
    }
}
